A polynomial algorithm for the membership problem with categorial grammars
نویسندگان
چکیده
منابع مشابه
A Polynomial Algorithm for the Membership Problem with Categorial Grammars
This article presents an overview of a framework called categorial grammars from a theoretical and algorithmic perspective. It provides an introduction to the formalisms of these grammars and of the tools they use (the Lambek Calculus) for theoretical computer scientists who are not familiar with them. We give a clear presentation of the main classical and recent results on these grammars, espe...
متن کاملOn the Membership Problem for Non-Linear Abstract Categorial Grammars
In this paper we show that the membership problem for second order nonlinear Abstract Categorial Grammars is decidable. A consequence of that result is that Montague-like semantics yield to a decidable text generation problem. Furthermore the proof we propose is based on a new tool, Higher Order Intersection Signatures, which grasps statically dynamic properties of λ-terms and presents an inter...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولPolynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating a representation of the parse trees has two phases. Initially, a shared forest is build that encodes the set of all derivation trees for the input string. This shared forest is then pruned to remove all spurious ambig...
متن کاملMembership for Growing Context Sensitive Grammars is Polynomial
2. Introduction. Context-sensitive grammars (csgs) are one of the classical grammar families of formal language theory. They were introduced in [Ch59] and have been studied extensively since then (see []3073, Ha78] for an overview). Context-sensitive grammars are defined as rewriting systems, where the length of the right hand side of every production is at least as large as the length of the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00211-1